Scheduling independent two processor tasks on a uniform duo-processor system
نویسندگان
چکیده
منابع مشابه
Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor
In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give necessary and su cient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested e ciently (unless P =NP). They do, however, lead to a feasibility test that runs in e cient pseudo-polynomial time for a very large ...
متن کاملTwo Processor Scheduling is in NC
WC prcsc~~t a parallcl dgorithm for tlic two processor scheduling problem. with iLrbit,rnry prccctl~~~cc constraints lluillg a polynorhd II~I~I~~HX of processors and for the problem luadc cxtcnsivc USC of randomization, our algorithm is complctcly dctcrkuistic and bnscd 011 rln intercsling dccomposi t i o n tcchuique. indcpcntlcnt rclcvarice for two more rcasous. And it is of It provides anothe...
متن کاملProcessor Scheduling on Parallel Computers
Many problems in computer vision and image processing present potential for parallel implementations through one of the three major paradigms of geometric parallelism, algorithmic parallelism and processor farming. Static process scheduling techniques are used successfully to exploit geometric and algorithmic parallelism, while dynamic process scheduling is better suited to dealing with the ind...
متن کاملScheduling Hard Real-Time Tasks with 1-Processor-Fault-Tolerance
Real-time systems are being extensively used in applications that are mission-critical and life-critical, such as space exploration, aircraft avionics, and robotics. Since these systems are usually operating in environments that are non-deterministic, and even hazardous, it is extremely important that hard deadlines of tasks be met even in the presence of certain failures. To tolerate processor...
متن کاملScheduling Tasks of a Parallel Program in Two-Processor Systems with Use of Cellular Automata
Cellular automata (CA) are proposed to design scheduling algorithms for allocating tasks of a parallel program in multiprocessor systems. For this purpose a program graph is considered as CA which control a process of migration of tasks in a multiprocessor system. In the rst phase of the algorithm, e ective rules for CA are discovered by a genetic algorithm. In the second phase, for any initial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90090-y